A Pumping Lemma for Collapsible Pushdown Graphs of Level 2
نویسنده
چکیده
We present a pumping lemma for the class of collapsible pushdown graphs of level 2. This pumping lemma even applies to the ε-contractions of level 2 collapsible pushdown graphs. Our pumping lemma also improves the bounds of Hayashi’s pumping lemma for indexed languages. 1998 ACM Subject Classification F.1.1 Models of Computation
منابع مشابه
Strictness of the Collapsible Pushdown Hierarchy
We present a pumping lemma for each level of the collapsible pushdown graph hierarchy in analogy to the second author’s pumping lemma for higher-order pushdown graphs (without collapse). Using this lemma, we give the first known examples that separate the levels of the collapsible pushdown graph hierarchy and of the collapsible pushdown tree hierarchy, i.e., the hierarchy of trees generated by ...
متن کاملA Pumping Lemma for Pushdown Graphs of Any Level
We present a pumping lemma for the class of ε-contractions of pushdown graphs of level n, for each n. A pumping lemma was proposed by Blumensath, but there is an irrecoverable error in his proof; we present a new proof. Our pumping lemma also improves the bounds given in the invalid paper of Blumensath. 1998 ACM Subject Classification F.1.1 Models of Computation
متن کاملFirst-Order Model Checking on Generalisations of Pushdown Graphs
We study the first-order model checking problem on two generalisations of pushdown graphs. The first class is the class of nested pushdown trees. The other is the class of collapsible pushdown graphs. Our main results are the following. First-order logic with reachability is uniformly decidable on nested pushdown trees. Considering first-order logic without reachability, we prove decidability i...
متن کاملFO Model Checking on Nested Pushdown Trees
Nested Pushdown Trees are unfoldings of pushdown graphs with an additional jump-relation. These graphs are closely related to collapsible pushdown graphs. They enjoy decidable μ-calculus model checking while monadic second-order logic is undecidable on this class. We show that nested pushdown trees are tree-automatic structures, whence first-ordermodel checking is decidable. Furthermore, we pro...
متن کاملOn the structure of graphs in the Caucal hierarchy
Recently Pawel Parys [3] pointed out an error in the article “On the structure of graphs in the Caucal hierarchy” [1], which contains two main results: Theorems 15 and 61. Theorem 61 is a pumping lemma for higher-order pushdown automata. The proof consists in two parts: (1) a series of technical lemmas that, given a run of the automaton containing a so-called pumping pair, constructs a longer r...
متن کامل